منابع مشابه
Random graphs with clustering.
We offer a solution to a long-standing problem in the theory of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity--the propensity for two neighbors of a network node also to be neighbors of one another. We show how standard random-graph models can be generalized to incorporate clustering and give exact solutions for various properties of...
متن کاملA Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملA Random Tree Model Associated with Random Graphs
Grow a tree on n vertices by starting with no edges and successively adding an edge chosen uniformly from the set of possible edges whose addition would not create a cycle. This process is closely related to the classical random graph process. We describe the asymptotic structure of the tree, as seen locally from a given vertex. In particular, we give an explicit expression for the asymptotic d...
متن کاملRandom Trees in Random Graphs
We show that a random labeled n-vertex graph almost surely contains isomorphic copies of almost all labeled n-vertex trees, in two senses. In the first sense, the probability of each edge occurring in the graph diminishes as n increases, and the set of trees referred to as "almost all" depends on the random graph. In the other sense, the probability of an edge occurring is fixed, and the releva...
متن کاملRandom Walks on Random Graphs
The aim of this article is to discuss some of the notions and applications of random walks on finite graphs, especially as they apply to random graphs. In this section we give some basic definitions, in Section 2 we review applications of random walks in computer science, and in Section 3 we focus on walks in random graphs. Given a graphG = (V,E), let dG(v) denote the degree of vertex v for all...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tsukuba Journal of Mathematics
سال: 2011
ISSN: 0387-4982
DOI: 10.21099/tkbjm/1311081455